|
Common spatial pattern (CSP) is a mathematical procedure used in signal processing for separating a multivariate signal into additive subcomponents which have maximum differences in variance between two windows.〔Zoltan J. Koles, Michael S. Lazaret and Steven Z. Zhou, ("Spatial patterns underlying population differences in the background EEG" ), Brain topography, Vol. 2 (4) pp. 275-284, 1990〕 == Details == Let of size and of size be two windows of a multivariate signal, where is the number of signals and and are the respective number of samples. The CSP algorithm determines the component such that the ratio of variance (or second-order moment) is maximized between the two windows: : The solution is given by computing the two covariance matrices: : : Then, the simultaneous diagonalization of those two matrices (also called generalized eigenvalue decomposition) is realized. We find the matrix of eigenvectors and the diagonal matrix of eigenvalues sorted by decreasing order such that: : and : with the identity matrix. This is equivalent to the eigendecomposition of : : : will correspond to the first column of : : 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Common spatial pattern」の詳細全文を読む スポンサード リンク
|